A Kiefer – Wolfowitz Comparison Theorem for Wicksell ’ S Problem

نویسندگان

  • Xiao Wang
  • Michael Woodroofe
چکیده

We extend the isotonic analysis for Wicksell's problem to estimate a regression function, which is motivated by the problem of estimating dark matter distribution in astronomy. The main result is a version of the Kiefer–Wolfowitz theorem comparing the empirical distribution to its least concave majorant, but with a convergence rate n −1 log n faster than n −2/3 log n. The main result is useful in obtaining asymptotic distributions for estimators, such as isotonic and smooth estimators. 1. Introduction. Our starting point is Groeneboom and Jongbloed's [5] analysis of Wicksell's [12] " Corpuscle Problem, " in anatomy: Given cross-sections of a large number of corpuscles of different sizes, the distribution of radii of corpuscles was to be estimated. Assuming corpuscles were spherical, the relation between the distribution of the corpuscle radii and the distribution of the observable circular sections was derived. Wicksell approximated the density of spherical radii by a step function and then used the distri-butional relationship between spherical radii and circular radii to estimate the distribution of spherical radii. Groeneboom and Jongbloed [5] showed how isotonic techniques can be used in Wicksell's problem. They related the distribution of spherical radii to a nonincreasing function that can be estimated unbiasedly. The unbiased estimate was not monotone, however, and they showed how it can be improved by imposing the shape restriction. Here we extend the isotonic analysis to estimate a regression function. The extension is motivated by the problem of estimating the velocity dispersions in astronomy which, in turn, is motivated by the problem of estimating the distribution of dark matter, as explained in [11].) denote the three-dimensional position and velocity of

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

N ov 2 00 6 A Kiefer Wolfowitz Comparison Theorem For Wicksell ’ s Problem

We extend the isotonic analysis for the Wicksell’s problem to estimate a regression function, which is motivated by the problem of estimating dark matter distribution in Astronomy. The main result is a version of the Kiefer-Wolfowitz theorem comparing the empirical distribution to its least concave majorant, but with a convergence rate n −1 log n faster than n−2/3 log n. The main result is usef...

متن کامل

A companion for the Kiefer-Wolfowitz-Blum stochastic approximation algorithm

A stochastic algorithm for the recursive approximation of the location θ of a maximum of a regression function has been introduced by Kiefer and Wolfowitz (1952) in the univariate framework, and by Blum (1954) in the multivariate case. The aim of this paper is to provide a companion algorithm to the Kiefer-Wolfowitz-Blum algorithm, which allows to simultaneously recursively approximate the size...

متن کامل

Convex Optimization, Shape Constraints, Compound Decisions, and Empirical Bayes Rules

Estimation of mixture densities for the classical Gaussian compound decision problem and their associated (empirical) Bayes rules is considered from two new perspectives. The first, motivated by Brown and Greenshtein (2009), introduces a nonparametric maximum likelihood estimator of the mixture density subject to a monotonicity constraint on the resulting Bayes rule. The second, motivated by Ji...

متن کامل

On a Problem of Robbins

Robbins’s visionary 1951 paper can be seen as an exercise in binary classification, but also as a precursor to the outpouring of recent work on high-dimensional data analysis and multiple testing. It can also be seen as the birth of empirical Bayes methods. Our objective in the present note is to use this problem and several variants of it to provide a glimpse into the evolution of empirical Ba...

متن کامل

General Bounds and Finite-Time Improvement for the Kiefer-Wolfowitz Stochastic Approximation Algorithm

We consider the Kiefer-Wolfowitz (KW) stochastic approximation algorithm and derive general upper bounds on its meansquared error. The bounds are established using an elementary induction argument and phrased directly in the terms of tuning sequences of the algorithm. From this we deduce the nonnecessity of one of the main assumptions imposed on the tuning sequences by Kiefer and Wolfowitz [Kie...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2007